Axiomatizing Epistemic Logic of Friendship via Tree Sequent Calculus
نویسنده
چکیده
This paper positively solves an open problem if it is possible to provide a Hilbert system to Epistemic Logic of Friendship (EFL) by Seligman, Girard and Liu. To find a Hilbert system, we first introduce a sound, complete and cut-free tree (or nested) sequent calculus for EFL, which is an integrated combination of Seligman’s sequent calculus for basic hybrid logic and a tree sequent calculus for modal logic. Then we translate a tree sequent into an ordinary formula to specify a Hilbert system of EFL and finally show that our Hilbert system is sound and complete for an intended two-dimensional semantics.
منابع مشابه
Sequent Calculus for Intuitionistic Epistemic Logic
The formal system of intuitionistic epistemic logic IEL was proposed by S. Artemov and T. Protopopescu. It provides the formal foundation for the study of knowledge from an intuitionistic point of view based on Brouwer-Hayting-Kolmogorov semantics of intuitionism. We construct a cut-free sequent calculus for IEL and establish that polynomial space is sufficient for the proof search in it. So, w...
متن کاملAxiomatizing a Real-Valued Modal Logic
A many-valued modal logic is introduced that combines the standard (crisp) Kripke frame semantics of the modal logic K with connectives interpreted locally as abelian group operations over the real numbers. A labelled tableau system and a sequent calculus admitting cut elimination are then defined for this logic and used to establish completeness of an axiomatic extension of the multiplicative ...
متن کاملFirst-Order Inquisitive Pair Logic
We introduce two different calculi for a first-order extension of inquisitive pair semantics (Groenendijk 2008): Hilbert-style calculus and Tree-sequent calculus. These are first-order generalizations of (Mascarenhas 2009) and (Sano 2009), respectively. First, we show the strong completeness of our Hilbert-style calculus via canonical models. Second, we establish the completeness and soundness ...
متن کاملAlgebra and Sequent Calculus for Epistemic Actions
We introduce an algebraic approach to Dynamic Epistemic Logic. This approach has the advantage that: (i) its semantics is a transparent algebraic object with a minimal set of primitives from which most ingredients of Dynamic Epistemic Logic arise, (ii) it goes with the introduction of non-determinism, (iii) it naturally extends beyond boolean sets of propositions, up to intuitionistic and non-d...
متن کاملCut-free common knowledge
Starting off from the infinitary system for common knowledge over multi-modal epistemic logic presented in Alberucci and Jäger [1], we apply the finite model property to “finitize” this deductive system. The result is a cut-free, sound and complete sequent calculus for common knowledge.
متن کامل